Inline hologram reconstruction with sparsity constraints
نویسندگان
چکیده
منابع مشابه
Inline hologram reconstruction with sparsity constraints.
Inline digital holograms are classically reconstructed using linear operators to model diffraction. It has long been recognized that such reconstruction operators do not invert the hologram formation operator. Classical linear reconstructions yield images with artifacts such as distortions near the field-of-view boundaries or twin images. When objects located at different depths are reconstruct...
متن کاملReconstruction of Channelized Facies Using Sparsity Constraints
A new approach is presented for inverse modeling to reconstruct continuous features in space, such as channels, that exhibit sparseness in a complementary basis (e.g. a Fourier basis) using observations in spatial domain. Continuity in space is used to constrain the solution to be sparse in the discrete cosine transform (DCT) domain. The DCT is used to effectively reduce the dimension of the se...
متن کاملRapid autotuning for crystalline specimens from an inline hologram.
A method to measure the aberration function for a crystalline specimen from a single inline hologram or 'Ronchigram' by dividing it up into small patches is derived. Measurement of aberrations is demonstrated from both dynamical simulations and experimental Ronchigrams. This method should allow rapid fine-tuning on a variety of crystalline specimens and represents a key step toward active optic...
متن کاملSurface inpainting with sparsity constraints
In this paper we devise a new algorithm for completing surface with missing geometry and topology founded upon the theory and techniques of sparse signal recovery. The key intuition is that any meaningful 3D shape, represented as a discrete mesh, almost certainly possesses a low-dimensional intrinsic structure, which can be expressed as a sparse representation in some transformed domains. Inste...
متن کاملTrading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the resulting optimization problem is generally NP-hard, several approximation algorithms are considered. We analyze the performance of these algorithms, focusing on the characterization of the trade-off between accuracy a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Letters
سال: 2009
ISSN: 0146-9592,1539-4794
DOI: 10.1364/ol.34.003475